Search results for "Edge-transitive graph"

showing 2 items of 2 documents

Homeomorphic graph manifolds: A contribution to the μ constant problem

1999

Abstract We give a characterization, in terms of homological data in covering spaces, of those maps between (3-dimensional) graph manifolds which are homotopic to homeomorphisms. As an application we give a condition on a cobordism between graph manifolds that guarantees that they are homeomorphic. This in turn is applied to give a partial result on the μ -constant problem in (complex) dimension three.

SingularityDimension (graph theory)CobordismBanach manifoldHomology equivalenceCovering spaceμ constant problemMathematics::Algebraic TopologyMathematics::Geometric TopologyDistance-regular graphManifoldCombinatoricsCoxeter graphSeifert fibered spaceMilnor fiberGraph manifoldEdge-transitive graphRicci-flat manifoldComplex algebraic surfaceGeometry and TopologyMathematics::Symplectic Geometry3-manifoldHomeomorphismMathematicsTopology and its Applications
researchProduct

A dual of 4-regular graph forG × C2n

2003

Abstract A graph is said h-decomposable if its edge-set is decomposable into edge-disjoint hamiltonian cycles. Jha [3] conjectured that if G is a non-bipartite h-decomposable graph on even number of vertices, then G × K2 is h-decomposable. We use the notion of dual graph defined in [4], we prove that if G = Q1,2 ⊕ C3,4 is a 4-regular non-bipartite h-decomposable graph and the dual graphs relative to Q1,2 and C3,4 are connected then G × K 2 and G × C 2n are h-decomposable (where C 2n is an even cycle).

Discrete mathematicsStrongly regular graphAlgebra and Number TheoryApplied MathematicsDistance-regular graphCombinatoricsVertex-transitive graphEdge-transitive graphGraph powerRegular graphBound graphGraph toughnessAnalysisMathematicsJournal of Discrete Mathematical Sciences and Cryptography
researchProduct